Structure and Expressiveness of Visual Computer Languages

نویسنده

  • Clarisse Sieckenius de Souza
چکیده

One of the meanings that can be assigned to the expression Visual Programming Language (VPL) is that of a programming language whose tokens are visual, rather than textual. Despite the linguistic parallel, however, VPL's can hardly challenge their textual counterparts in the construction of even very simple software programs. But Visual Command Languages (VCL's) seem to have nearly overtaken their textual counterparts as a protocol for user-system interaction. Thus, the very nature of software programs and interface commands appear to be differentially suited for visual representation. In this paper, a classification of visual languages is proposed with respect to the dimensions of structural complexity and interactivity. Whereas languages deprived of a cognitively clear conceptual model in the semantic component seem to be necessarily low on the interactive side, languages deprived of formally clear structuring rules in the syntactic component do not. But, the lack of a powerful grammar seems to affect the language's ability to represent adequately the elements involved in even the simplest computer processes. In order to integrate the adequacy of VCL's to a programming environment, an end-user VPL schema is presented, in which visual parametric and syntactic variations of a classical fractal image — the Koch Curve — are assigned perceptually motivated procedural meanings. Although images in this VPL schema are abstract, and not semiotically iconic or indexical as the majority of VCL images, underlying structural regularities seem to accommodate consistently some semantic notions related to data, control and modular abstractions. A global linguistic and semiotic analysis of the proposed VPL schema suggests that there may be important expressive limits to the quality of genuinely visual programming languages. Nevertheless, the limits of successful visual command languages may apparently be extended to incorporate abstractions that are desirable for end-user programming applications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enhancing the Expressiveness of Spider Diagram Systems

Many visual languages based on Euler diagrams have emerged for expressing relationships between sets. The expressive power of these languages varies, but the majority are monadic and some include equality. Spider diagrams are one such language, being equivalent in expressive power to monadic first order logic with equality. Spiders are used to represent the existence of elements or specific ind...

متن کامل

Defining star-free regular languages using diagrammatic logic

Spider diagrams are a recently developed visual logic that make statements about relationships between sets, their members and their cardinalities. By contrast, the study of regular languages is one of the oldest active branches of computer science research. The work in this thesis examines the previously unstudied relationship between spider diagrams and regular languages. In this thesis, the ...

متن کامل

Visual Query Languages, Representation Techniques, and Data Models

An easy, efficient, and effective way to retrieve stored data is obviously one of the key issues of any information system. In the last few years, considerable effort has been devoted to the definition of more intuitive, visual-based querying paradigms, attempting to offer a good trade-off between expressiveness and intuitiveness. In this chapter, we analyze the main characteristics of visual l...

متن کامل

Evaluation and Ranking of Discrete Simulation Tools

In studying through simulation, choosing an appropriate tool/language would be a difficult task because many of them are available. On the other hand, few research works focus on evaluation of simulation tools/languages and their comparison. This paper makes a couple of evaluations and ranks more than fifty simulation tools that are currently available. The first evaluation and ranking is in th...

متن کامل

TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES

We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994